Multidimensional query based routing for virtual environments

In this paper we propose a new architecture based on Z-order curve and kd-tree that can efficiently handle issues related to update messages distribution to interested entities locations in a three-dimensional (3D) virtual environments where locations are described in terms of 3D coordinates. We also aim to minimize the number of routing hops in distribution of update messages, especially when updates are forwarded to a specific range of users/entities in the virtual environment. Our results are promising and show improvements in both of the objectives.